Sub-Pixel Processing in Successive Abandonment Algorithm of PIV
نویسندگان
چکیده
منابع مشابه
Accelerated Super-Resolution PIV based on Successive Abandonment Method
The super-resolution PIV based on the recursive division of interrogation window has attracted interest recently. This approach needs careful error checks because results are largely affected by the pre-step displacements obtained by large interrogation windows. Hart (2000 Experiments in Fluids Vol.29-1) proposed the error check method by multiplication between correlation distributions of over...
متن کاملNew Algorithm for Sub-pixel Boundary Mapping
Remotely sensed images often contain a combination of both pure and mixed pixels. Analysis and classification of remotely sensed imagery used to provide information on the spatial pattern of land cover feature suffer from the problem of class mixing within pixels. Therefore, how to get spatial pattern and boundaries information of endmembers in sub-pixel scale has been receiving increasing atte...
متن کاملModification of Pixel-swapping Algorithm with Initialization fr om a Sub-pixel/pixel Spatial Attraction Model
Pixel-swapping algorithm is a simple and efficient technique for sub-pixel mapping (Atkinson, 2001 and 2005). It was initially applied in shoreline and rural land-cover mapping but has been expanded to other land-cover mapping. However, due to its random initializing process, this algorithm must swap a large number of sub-pixels, and therefore it is computation intensive. This computing power c...
متن کاملEvaluation of sub-pixel fiducial tracking using image processing
Introduction. Resonant micro-coil fiducial markers are increasingly being used to track devices within an MRI scanner [1,2]. Good results have been obtained with previously described methods of tracking such as multiple application of 1-D gradients [3,4]. Image processing has also been applied to track devices with 3D reconstruction [5]. In this report, we assess various image-processing algori...
متن کاملSub-Optimal Feedback Control Using a Successive Wavelet-Galerkin Algorithm
We present a numerical algorithm for solving the Hamilton-Jacobi Bellman equation using a successive Galerkin-wavelet projection scheme. According to this scheme, the so-called Generalized-HamiltonJacobi-Bellman (GHJB) equation is solved iteratively starting from a stabilizing solution. As basis function for the Galerkin projections we consider the antiderivatives of the well-known Daubechies’ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Visualization Society of Japan
سال: 1998
ISSN: 1884-037X,0916-4731
DOI: 10.3154/jvs.18.supplement1_67